The minimax learning rates of normal and Ising undirected graphical models
نویسندگان
چکیده
منابع مشابه
Learning Undirected Graphical Models with Structure Penalty
In undirected graphical models, learning the graph structure and learning the functions that relate the predictive variables (features) to the responses given the structure are two topics that have been widely investigated in machine learning and statistics. Learning graphical models in two stages will have problems because graph structure may change after considering the features. The main con...
متن کاملUndirected Graphical Models
Read: Chapters 5 and 6 of [CGH]. The first model for a joint probability distribution that we will consider is the undirected graph. We will undirected graphs using two different methods. First, we will show the relationship between undirected graphs and joint probability distributions. Second, we will show the relationship between undirected graphs, and an abstract independence model (called a...
متن کاملNeural Variational Inference and Learning in Undirected Graphical Models
Many problems in machine learning are naturally expressed in the language of undirected graphical models. Here, we propose black-box learning and inference algorithms for undirected models that optimize a variational approximation to the log-likelihood of the model. Central to our approach is an upper bound on the logpartition function parametrized by a function q that we express as a flexible ...
متن کاملEDML for Learning Parameters in Directed and Undirected Graphical Models
EDML is a recently proposed algorithm for learning parameters in Bayesian networks. It was originally derived in terms of approximate inference on a meta-network which underlies the Bayesian approach to parameter estimation. While this initial derivation helped discover EDML in the first place and provided a concrete context for identifying some of its properties (e.g., in contrast to EM), the ...
متن کاملStructure Learning of Undirected Graphical Models with Contrastive Divergence
Structure learning of Markov random fields (MRFs) is generally NP-hard (Karger & Srebro, 2001). Many structure learners and theoretical results are under the correlation decay assumption in the sense that for any two nodes i and k, the information about node i captured by node k is less than that captured by node j where j is the neighbor of i on the shortest path between i and k (Netrapalli et...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Statistics
سال: 2020
ISSN: 1935-7524
DOI: 10.1214/20-ejs1721